DisBO-wd: a Distributed Constraint Satisfaction Algorithm for Coarse-Grained Distributed Problems
نویسندگان
چکیده
We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained DisCSPs where we introduce a constraint weight decay and a constraint weight learning mechanism in order to escape local optima. We also introduce some randomisation in order to give the search a better chance of finding the right path to a solution. We show that these mechanisms improve the performance of the algorithm considerably and make it competitive with respect to other algorithms.
منابع مشابه
A hybrid approach to solving coarse-grained DisCSPs
A coarse-grained Distributed Constraint Satisfaction Problem (DisCSP) consists of several loosely connected constraint satisfaction subproblems, each assigned to an individual agent. We present Multi-Hyb, a two-phase concurrent hybrid approach for solving DisCSPs. In the first phase, each agent’s subproblem is solved using systematic search which generates the key partial solutions to the globa...
متن کاملFinite Constraint Satisfaction : Complexity , Algorithms and
This paper explores the parallel complexity of nite constraint satisfaction problems (FCSPs) by developing three algorithms for deriving minimal constraint networks in parallel. The rst is a parallel algorithm for the EREW PRAM model, the second is a distributed algorithm for ne-grain interconnected networks, and the third is a distributed algorithm for coarse-grain interconnected networks. Our...
متن کاملA Distributed Arc-Consistency Algorithm
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time optimal AC-4 sequential algorithm of Mohr and Henderson [8]. In this paper, we present a new distributed arc-consistency algorithm, called DisAC-4. DisAC-4 is based on AC-4, and is a coarse-grained parallel algorithm ...
متن کاملNogood-FC for solving partitionable constraint satisfaction problems
Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a g...
متن کاملA hybrid evolutionary approach for solving constrained optimization problems over finite domains
A novel approach for the integration of evolution programs and constraint-solving techniques over finite domains is presented. This integration provides a problem-independent optimization strategy for large-scale constrained optimization problems over finite domains. In this approach, genetic operators are based on an arc-consistency algorithm, and chromosomes are arc-consistent portions of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007